Exact approaches for the knapsack problem with setups
نویسندگان
چکیده
منابع مشابه
Exact approaches for the knapsack problem with setups
We consider a generalization of the knapsack problem in which items are partitioned into classes, each characterized by a fixed cost and capacity. We study three alternative Integer Linear Programming formulations. For each formulation, we design an efficient algorithm to compute the linear programming relaxation (one of which is based on Column Generation techniques). We theoretically compare ...
متن کاملAn exact approach for the 0-1 knapsack problem with setups
We consider the 0–1 Knapsack Problem with Setups. We propose an exact approach which handles the structure of the ILP formulation of the problem. It relies on partitioning the variables set into two levels and exploiting this partitioning. The proposed approach favorably compares to the algorithms in literature and to solver CPLEX 12.5 applied to the ILP formulation. It turns out to be very eff...
متن کاملA cross entropy algorithm for the Knapsack problem with setups
In this article we propose a new metaheuristic-based algorithm for the Integer Knapsack Problem with Setups. This problem is a generalization of the standard Integer Knapsack Problem, complicated by the presence of setup costs in the objective function as well as in the constraints. We propose a cross entropy based algorithm, where the metaheuristic scheme allows to relax the original problem t...
متن کاملKnapsack problems with setups
RÉSUMÉ : We consider two variants of knapsack problems with setups arising as subproblems in a DantzigWolfe decomposition approach to more complex combinatorial optimization problems. In the multiple-class binary knapsack problem with setups, items are partitioned into classes whose use implies a setup cost and associated capacity consumption. Item weights are assumed to be a multiple of their ...
متن کاملExact Algorithms for the Knapsack Problem with Setup
Fabio Furini PSL, Université Paris Dauphine, CNRS, LAMSADE UMR 7243 75775 Paris Cedex 16, France, [email protected] Michele Monaci DEI, University of Bologna, Viale Risorgimento 2, I-40136 Bologna, Italy, [email protected] Emiliano Traversi Laboratoire d’Informatique de Paris Nord, Université de Paris 13, Sorbonne Paris Cité, 99, Avenue J.-B. Clement 93430 Villetaneuse, France, emi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2018
ISSN: 0305-0548
DOI: 10.1016/j.cor.2017.09.019